A Monte Carlo Algorithm for Studying the Collapse Transition in Lattice Animals
نویسنده
چکیده
Polymers in dilute solution are expected to collapse from expanded to compact structures as either solvent quality or temperature is reduced. This collapse phase transition can be modelled using a lattice animal model which includes both monomer-solvent molecule interactions and monomer-monomer interactions. We discuss a Monte Carlo algorithm developed by us to study this two parameter lattice animal model on the square lattice. Results from this algorithm for the interesting special case of a zero valued monomer-monomer interaction, the solvent model, are presented.
منابع مشابه
METAHEURISTIC-BASED SIZING AND TOPOLOGY OPTIMIZATION AND RELIABILITY ASSESSMENT OF SINGLE-LAYER LATTICE DOMES
Economy and safety are two important components in structural design process and stablishing a balance between them indeed results in improved structural performance specially in large-scale structures including space lattice domes. Topology optimization of geometrically nonlinear single-layer lamella, network, and geodesic lattice domes is implemented using enhanced colliding-bodies optimizati...
متن کاملMonte Carlo Investigation of Lattice Models of Polymer Collapse in Five Dimensions
Monte Carlo simulations, using the PERM algorithm, of interacting self-avoiding walks (ISAW) and interacting self-avoiding trails (ISAT) in five dimensions are presented which locate the collapse phase transition in those models. It is argued that the appearance of a transition (at least) as strong as a pseudo-first-order transition occurs in both models. The values of various theoretically con...
متن کاملA new monte carlo algorithm for growing compact Self Avoiding Walks
We propose an algorithm based on local growth rules for kinetically generating self avoiding walk configurations at any given temperature. This algorithm, called the Interacting Growth Walk (IGW) algorithm, does not suffer from attrition on a square lattice at zero temperature, in cotrast to the existing algorithms. More importantly, the IGW algorithm facilitates growing compact configurations ...
متن کاملThe Collapse Transition in the HP Model
We studied the collapse transition on small homopolymeric and heteropolymeric sequences in the HP model on a two dimensional square lattice both with exact enumerations and Monte Carlo simulations. For heteropolymers, our analysis is restricted to native sequences (sequences which present one single minimal energy connguration) with a xed fraction of hydrophobic residues (= N H =N = 0:5). In th...
متن کاملComputational Analysis of 3D Ising Model Using Metropolis Algorithms
We simulate the Ising Model with the Monte Carlo method and use the algorithms of Metropolis to update the distribution of spins. We found that, in the specific case of the three-dimensional Ising Model, methods of Metropolis are efficient. Studying the system near the point of phase transition, we observe that the magnetization goes to zero. In our simulations we analyzed the behavior of the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007